Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPBW34M/3JNMEF5
Repositorysid.inpe.br/sibgrapi/2015/06.25.16.35
Last Update2015:06.25.16.35.35 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2015/06.25.16.35.35
Metadata Last Update2022:06.14.00.08.17 (UTC) administrator
DOI10.1109/SIBGRAPI.2015.41
Citation KeyDornellesHira:2015:SeWiWo
TitleSelection of windows for W-operator combination from entropy based ranking
FormatOn-line
Year2015
Access Date2024, May 02
Number of Files1
Size990 KiB
2. Context
Author1 Dornelles, Marta Magda
2 Hirata, Nina Sumiko Tomita
Affiliation1 Department of Exact and Technological Sciences, Universidade Estadual de Santa Cruz
2 Institute of Mathematics and Statistics, University of São Paulo
EditorPapa, João Paulo
Sander, Pedro Vieira
Marroquim, Ricardo Guerra
Farrell, Ryan
e-Mail Addressmmbertoldi@uesc.br
Conference NameConference on Graphics, Patterns and Images, 28 (SIBGRAPI)
Conference LocationSalvador, BA, Brazil
Date26-29 Aug. 2015
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2015-06-25 16:35:35 :: mmbertoldi@uesc.br -> administrator ::
2022-06-14 00:08:17 :: administrator -> :: 2015
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsbinary image
morphological operator design
W-operator combination
conditional entropy
sequential forward selection
AbstractWhen training morphological operators that are locally defined with respect to a neighborhood window, one must deal with the tradeoff between window size and statistical precision of the learned operator. More precisely, too small windows result in large restriction errors due to the constrained operator space and, on the other hand, too large windows result in large variance error due to often insufficient number of samples. A two-level training method that combines a number of operators designed on distinct windows of moderate size is an effective way to mitigate this issue. However, in order to train combined operators, one must specify not only how many operators will be combined, but also the windows for each of them. To date, a genetic algorithm that searches for window combinations has produced the best results for this problem. In this work we propose an alternative approach that is computationally much more efficient. The proposed method consists in efficiently reducing the search space by ranking windows of a collection according to an entropy based measure estimated from input- output joint probabilities. Computational efficiency comes from the fact that only few operators need to be trained. Experimental results show that this method produces results that outperform the best results obtained with manually selected combinations and are competitive with results obtained with the genetic algorithm based solution. The proposed approach is, thus, a promising step towards fully automating the process of binary morphological operator design.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2015 > Selection of windows...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Selection of windows...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 25/06/2015 13:35 0.7 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPBW34M/3JNMEF5
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3JNMEF5
Languageen
Target FilePID3771543.pdf
User Groupmmbertoldi@uesc.br
Visibilityshown
Update Permissionnot transferred
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPBW34M/3K24PF8
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2015/08.03.22.49 10
sid.inpe.br/banon/2001/03.30.15.38.24 1
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close